Bloch's theorem (complex variables)

In complex analysis, a field within mathematics, Bloch's theorem is a result that gives a lower bound on the size of the image of a certain class of holomorphic functions. It is named after André Bloch.

Statement

Let ƒ be a holomorphic function on a region (i.e. an open, connected subset of C) that includes as a subset the closed unit disk |z| ≤ 1. Suppose ƒ(0) = 0 and ƒ ′(0) = 1. Let b(ƒ) be the supremum of those numbers r such that there is a subregion S of the open unit disk |z| < 1 on which ƒ is injective and such that ƒ(S) contains a disk of radius r. Then b(ƒ) ≥ 1/72.

Bloch's constant

The lower bound 1/72 is not the best possible. The number B defined as the infimum of all b(ƒ) where ƒ satisfies the hypotheses of Bloch's theorem is called Bloch's constant. Bloch's theorem tells us B ≥ 1/72, but its exact value is still unknown.

The best known bounds for B at present are

\frac{\sqrt{3}}{4}%2B2\times10^{-4}\leq B\leq \frac{\Gamma(1/3)\cdot\Gamma(11/12)}{(\sqrt{1%2B\sqrt{3}})\cdot\Gamma(1/4)},

where Γ is the Gamma function. The lower bound was proved by Chen and Gauthier, and the upper bound dates back to Ahlfors and Grunsky.

In their paper, Ahlfors and Grunsky conjectured that their upper bound is actually the true value of B.

References